implicit weighting meaning in English

内含重量

Thus w ( h ) = ( v ) = d ( v ) , a heaviest cycle and a heaviest v - longest path are simply a longest cycle and a y - longest path respectively . the implicit weighted degree ic is just implicit degree id ( v ) ( see e . g
此时叫丑）旧（ i ，公… ）一叭t ）最重圈就是最长甩最重t ）一最触即t ）一最栅，隐赋鹏侦扣）就是雕妹叫（参见网）
The first section of this paper gives a brief introduction about the basic concepts , terminology and symboles which are used in this paper . in section 2 , we give an accurate discussion about the structure of a kind of graphs in [ 6 ] and get the extremal graph . in the third section , we introduce a new concept - - - - implicit weighted degree and using it we give a condition on the existence of heavy cycles in weighted graphs
在本文的第一部分中，我们简要介绍了论文中所涉及的一些概念，术语和符号；在第二部分中，我们对中图的结构进行了精确的讨论，给出了一个极图；在第三部分，我们定义了一个新参数?隐赋权度，给出了赋权图中重圈存在的隐赋权度条件；最后，在第四部分，我们给出了赋权图中过两点的重圈存在性的dirac型条件。